Near-Optimal Coding for Many-User Multiple Access Channels

Coding for T-user multiple-access channels

Coding schemes for the binary memoryless T-user adder channel are investigated in this paper. Fit upper and lower bounds on the capacity sum, which are asymptotically tight with increasing T, are derived for the noiseless case. Second, a class of T-user mdquely demdable codes with rates, asymptotically in T, equal to the maximal achievable vahes is constructed. A decoding algorithm for these co...

Coding for Two-User SISO and MIMO Multiple Access Channels

Constellation Constrained (CC) capacity regions of a two-user SISO Gaussian Multiple Access Channel (GMAC) with finite complex input alphabets and continuous output are computed in this paper. When both the users employ the same code alphabet, it is well known that an appropriate rotation between the alphabets provides unique decodability to the receiver. For such a set-up, a metric is proposed...

Robust coding for multiple-access channels

Multiple description coding with many channels

An achievable region for the -channel multiple description coding problem is presented. This region generalizes twochannel results of El Gamal and Cover and of Zhang and Berger. It further generalizes three-channel results of Gray and Wyner and of Zhang and Berger. A source that is successively refinable on chains is shown to be successively refinable on trees. A new outer bound on the rate-dis...

Optimal Code Design for Lossless and Near Lossless Source Coding in Multiple Access Networks

A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of correlated information sequences {Xi}lm_, and {x}lm_, is drawn i.i.d. according to joint probability mass function (p.m.f.) p ( z , y); the encoder for each source operates without knowledge of the other source; the decoder jointly decodes the encoded bit streams from both sources. ...